目标识别中的传感器管理方法

基于假设检验的方法,研究了目标识别中的传感器管理方法。分别以用于假设检验问题中的最大后验概率、最小代价函数和最大正确检测概率为目标函数,给出了用于目标识别问题的多传感器管理方法,并针对目标识别问题的特点,对其进行了相应的改进。通过对一定场景的仿真,比较了三种不同方法的识别正确率和平均采样次数,分析了各种方法的特点。     

导弹气动参数变化时PID与模糊控制的仿真

以参数大范围变化的导弹为研究对象,分别设计PID控制器和模糊控制器,并对PID控制器和模糊控制器组成的稳定回路进行仿真,仿真结果表明,PID控制器不能适应参数大范围的变化,表现为容易产生超调。简单模糊控制器对外界参数具有较好的适应性和鲁棒性,但存在稳态误差,通过采取模糊——积分并联混合,改善了模糊控制的稳态性能,提高了模糊控制的稳态精度。     

基于案例推理和模糊诊断的兵器故障诊断专家系统

讨论了基于案例的推理和模糊诊断矩阵在兵器故障中的应用 ,建立了兵器故障诊断WDDS -E系统模型和模糊诊断矩阵模型。详细说明了系统的工作原理和设计过程 ,并给出了应用实例     

Generating Pareto‐optimal boundary points in multiparty negotiations using constraint proposal method

In this paper a constraint proposal method is developed for computing Pareto‐optimal solutions in multiparty negotiations over continuous issues. Constraint proposal methods have been previously studied in a case where the decision set is unconstrained. Here we extend the method to situations with a constrained decision set. In the method the computation of the Pareto‐optimal solutions is decentralized so that the DMs do not have to know each others' value functions. During the procedure they have to indicate their optimal solutions on different sets of linear constraints. When the optimal solutions coincide, the common optimum is a candidate for a Pareto‐optimal point. The constraint proposal method can be used to generate either one Pareto‐optimal solution dominating the status quo solution or several Pareto‐optimal solutions. In latter case a distributive negotiation among the efficient points can be carried out afterwards. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 210–225, 2001     

后方油库整体生存概率分析计算

针对我军后方油库特点,探讨了油库整体生存概率计算的基本思路和方法,分析了各类分项目标生存概率的计算方法,采用层次分析对后方油库各分项目标权值进行了详细分析计算,可为后方油库伪装防护效能评估提供依据。     

Effectiveness of (R,Q) policies in one‐warehouse multiretailer systems with deterministic demand and backlogging

Consider a distribution system with a central warehouse and multiple retailers. Customer demand arrives at each of the retailers continuously at a constant rate. The retailers replenish their inventories from the warehouse which in turn orders from an outside supplier with unlimited stock. There are economies of scale in replenishing the inventories at both the warehouse and the retail level. Stockouts at the retailers are backlogged. The system incurs holding and backorder costs. The objective is to minimize the long‐run average total cost in the system. This paper studies the cost effectiveness of (R, Q) policies in the above system. Under an (R, Q) policy, each facility orders a fixed quantity Q from its supplier every time its inventory position reaches a reorder point R. It is shown that (R, Q) policies are at least 76% effective. Numerical examples are provided to further illustrate the cost effectiveness of (R, Q) policies. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 422–439, 2000     

Optimal policies for M/M/m queue with two different kinds of (N,T)‐policies

In this paper, two different kinds of (N, T)‐policies for an M/M/m queueing system are studied. The system operates only intermittently and is shut down when no customers are present any more. A fixed setup cost of K > 0 is incurred each time the system is reopened. Also, a holding cost of h > 0 per unit time is incurred for each customer present. The two (N, T)‐policies studied for this queueing system with cost structures are as follows: (1) The system is reactivated as soon as N customers are present or the waiting time of the leading customer reaches a predefined time T, and (2) the system is reactivated as soon as N customers are present or the time units after the end of the last busy period reaches a predefined time T. The equations satisfied by the optimal policy (N*, T*) for minimizing the long‐run average cost per unit time in both cases are obtained. Particularly, we obtain the explicit optimal joint policy (N*, T*) and optimal objective value for the case of a single server, the explicit optimal policy N* and optimal objective value for the case of multiple servers when only predefined customers number N is measured, and the explicit optimal policy T* and optimal objective value for the case of multiple servers when only predefined time units T is measured, respectively. These results partly extend (1) the classic N or T policy to a more practical (N, T)‐policy and (2) the conclusions obtained for single server system to a system consisting of m (m ≥ 1) servers. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 240–258, 2000     

机载传感器智能管理方法的研究

机载传感器智能管理有利于提高我机平台的隐身性能和传感器的利用效率,使我机在空战中处于有利态势.阐述了机载传感器智能管理的问题、基本概念,给出了传感器管理需要研究的内容,提出基于模糊推理的机载传感器智能管理的研究方案;针对各传感器的工作特点,考虑战场态势因素,研究基于模糊推理的传感器智能管理模型;在此基础上进行传感器智能管理系统仿真和软件设计.     

一种搜索鲁棒的中国余数定理的多基线相位解缠绕技术

多基线相位解缠绕的性能深受噪声水平制约，比如基于经典中国余数定理的相位解缠方法，由于其糟糕的抗噪声性能，限制了其在实际中的广泛运用。基于搜索鲁棒的余数定理，通过引入公因子，构建新的同余方程组，提出了一种搜索鲁棒的中国余数定理的相位解缠方法。仿真实验验证了该方法的有效性，并表明选择合理的公因子可以有效提高算法的抗噪声性能。